Swarm intelligent algorithm for re-entrant hybrid flow shop scheduling problems
نویسندگان
چکیده
منابع مشابه
Solving Re-entrant No-wait Flow Shop Scheduling Problem
In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...
متن کاملA hybrid genetic algorithm for the re-entrant flow-shop scheduling problem
This study considers the production environment of the re-entrant flow-shop (RFS). In a RFS, all jobs have the same routing over the machines of the shop and the same sequence is traversed several times to complete the jobs. The aim of this study is to minimize makespan by using the genetic algorithm (GA) to move from local optimal solution to near optimal solution for RFS scheduling problems. ...
متن کاملDesign of a genetic algorithm for bi-objective flow shop scheduling problems with re-entrant jobs
This paper presents a simulated genetic algorithm (GA) model of scheduling the flow shop problem with reentrant jobs. The objective of this research is to minimize the weighted tardiness and makespan. The proposed model considers that the jobs with non-identical due dates are processed on the machines in the same order. Furthermore, the re-entrant jobs are stochastic as only some jobs are requi...
متن کاملHybrid particle swarm algorithm for job shop scheduling problems
Particle swarm optimization (PSO) algorithm is a kind of random optimization algorithm based on swarm intelligence. Swarm intelligence of PSO is produced by cooperation and competition between particles, which is used for guiding optimization search. PSO has been studied widely in many applications due to its good global searching ability. Currently PSO has been widely used in function optimiza...
متن کاملEvolutionary Hybrid Particle Swarm Optimization Algorithm for Solving NP-Hard No-Wait Flow Shop Scheduling Problems
The no-wait flow shop is a flowshop in which the scheduling of jobs is continuous and simultaneous through all machines without waiting for any consecutive machines. The scheduling of a no-wait flow shop requires finding an appropriate sequence of jobs for scheduling, which in turn reduces total processing time. The classical brute force method for finding the probabilities of scheduling for im...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Simulation and Process Modelling
سال: 2019
ISSN: 1740-2123,1740-2131
DOI: 10.1504/ijspm.2019.097704